Lower bounds for on-line two-dimensional packing algorithms
نویسندگان
چکیده
منابع مشابه
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملLower bounds and algorithms for the 2-dimensional vector packing problem
Given n items, each having, say, a weight and a length, and n identical bins with a weight and a length capacity, the 2-Dimensional Vector Packing Problem (2-DVPP) calls for packing all the items into the minimum number of bins. The problem is NP-hard, and has applications in loading, scheduling and layout design. As for the closely-related Bin Packing Problem (BPP), there are two main possible...
متن کاملTwo Nonlinear Lower Bounds for On-Line Computations
One of the major goals of theoret ical computer science is proving nontrivial lower bounds on the (time or space) complexi ty of specific problems. Unfortunately, despite continued research effort for the last ten years, the success in proving lower bounds has been minimal. The only known general lower bounds are at least exponential [2, Chap. 1 1]. For no specific problem in NP can we prove a ...
متن کاملA New Model and Lower Bounds for Oriented Non- Guillotine Two-Dimensional Strip Packing
The oriented non-guillotine two-dimensional strip packing problem is investigated. Several 1D relaxations are considered and compared. Moreover, an ILP formulation of the 1D contiguous relaxation is given. The appropriate combination of some of the relaxations enables us the formulate a new ILP model of the strip packing problem.
متن کاملThe two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case
The Two-Dimensional Finite Bin Packing Problem (2BP) consists of determining the minimum number of large identical rectangles, bins, that are required for allocatingwithout overlapping a given set of rectangular items. The items are allocated into a bin with their edges always parallel or orthogonal to the bin edges. The problem is strongly NP-hard and finds many practical applications. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1982
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf00264439